package com.copa.l509;

/**
 * @author copa
 * @createDate 2022-06-28 17:22
 * @function 迭代法
 */
public class Test2 {

    public int fib(int n) {
        if (n < 2) {
            return n == 1 ? 1 : 0;
        }
        int[] dp = new int[n + 1];
        dp[0] = 0;
        dp[1] = 1;
        for (int i = 2; i <= n; i++) {
            dp[i] = dp[i - 1] + dp[i - 2];
        }
        return dp[n];
    }

    public static void main(String[] args) {
        System.out.println(new Test2().fib(5));
    }
}
